Priority-Slot-Based Continuous-Time MINLP Formulation for Crude-Oil Scheduling Problem with Two-Pipeline Transportation
نویسنده
چکیده
Some oil refineries arrange low-fusion-point crude oil storage tanks and ones containing high-fusionpoint crude oil at two diverse locations. Refinery needs different pipeline to transport different fusion point oil, so, to transport diverse fusion point oil it needs two pipelines. Because of the constraints resulted from transporting high-fusion-point oil, to schedule such a system is very hard. Based on single-operation sequencing (SOS), this paper proposes a new MINLP formulation with transporting high-fusion-point oil and two pipelines transportation. The formulation is different from previous ones as it takes transporting high-fusion-point oil and two-pipeline transportation into account. It aims at minimizing the sum of high-fusion-point oil transportation cost. A simple two-stage MILP-NLP procedure is applied to solve this model and get a satisfactory optimality gap. Finally, this paper gives an intricate industrial example to illustrate application of the formulation.
منابع مشابه
New Continuous-Time Formulation and Algorithm for Crude-Oil Scheduling Problems with Oil Residency Time Constraint and Pipeline Transportation
The optimal scheduling of crude-oil operation in refineries has been studied by various groups during the past decade, leading to different mixed integer linear programming or mixed nonlinear programming formulations. This paper proposes a new MINLP formulation with an oil residency time constraint and common pipeline transportation that is based on single-operation sequencing (SOS). An effecti...
متن کاملA Novel Priority-Slot Based Continuous-Time Formulation for Crude-Oil Scheduling Problems
The optimal scheduling of crude-oil operations in refineries has been studied by various groups during the past decade leading to different mixed integer linear programming (MILP) or mixed integer nonlinear programming (MINLP) formulations. This paper presents a new continuous-time formulation, called single-operation sequencing (SOS) model, which can be used to solve the crude-oil operations p...
متن کاملCrude Oil Short-Term Scheduling Algorithm with Multiple Charging Tanks Charging a Distiller Overlapingly Based on Priority-Slot Continuous-Time Formulation
The optimal scheduling of crude-oil operation in refineries has been researched by various groups during the past decade. Different mixed integer linear programming or mixed nonlinear programming formulations are derived. This paper proposes a novel MINLP formulation with multiple charging tanks charging a distiller overlapingly and oil residency time constraint that is based on multi-operation...
متن کاملOptimal Scheduling of Refinery Crude-Oil Operations
This thesis deals with the development of mathematical models and algorithms for optimizing refinery crude-oil operations schedules. The problem can be posed as a mixed-integer nonlinear program (MINLP), thus combining two major challenges of operations research: combinatorial search and global optimization. First, we propose a unified modeling approach for scheduling problems that aims at brid...
متن کاملAn Improved Optimization Model for Scheduling of a Multi-Product Tree-Like Pipeline
In the petroleum supply chain, oil refined products are often delivered to distribution centers by pipelines since they provide the most reliable and economical mode of transportation over large distances. This paper addresses the optimal scheduling of a complex pipeline network with multiple branching lines. The main challenge is to find the optimal sequence and time of product injections/deli...
متن کامل